Multitrack Interval Graphs
نویسنده
چکیده
A d-track interval is a union of d intervals, one each from d parallel lines. The intersection graphs of d-track intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G. The track number for K m;n is determined by proving that the arboricity of K m;n equals its \caterpillar arboricity". Recognition of graphs with track number 2 is shown to be NP-complete.
منابع مشابه
Graph-Based Channel Detection for Multitrack Recording Channels
We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting sparseness of twodimensional partial response (PR) channels, we develop an algorithm which performs belief propagation (BP) over corresponding factor graphs. We consider the BP-based detector not only for partial response channels but also for more practical conventional media and bit-patte...
متن کاملEvent-based Multitrack Alignment using a Probabilistic Framework
This paper presents a Bayesian probabilistic framework for real-time alignment of a recording or score with a live performance using an event-based approach. Multitrack audio files are processed using existing onset detection and harmonic analysis algorithms to create a representation of a musical performance as a sequence of time-stamped events. We propose the use of distributions for the posi...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملAn Analysis/Synthesis Framework for Automatic F0 Annotation of Multitrack Datasets
Generating continuous f0 annotations for tasks such as melody extraction and multiple f0 estimation typically involves running a monophonic pitch tracker on each track of a multitrack recording and manually correcting any estimation errors. This process is labor intensive and time consuming, and consequently existing annotated datasets are very limited in size. In this paper we propose a framew...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کامل